Approximate Evidential Reasoning Using Local Conditioning and Conditional Belief Functions

نویسنده

  • Van Nguyen
چکیده

We propose a new message-passing belief propagation method that approximates belief updating on evidential networks with conditional belief functions. By means of local conditioning, the method is able to propagate beliefs on the original multiply-connected network structure using local computations, facilitating reasoning in a distributed and dynamic context. Further, by use of conditional belief functions in the form of partially defined plausibility and basic plausibility assignment functions, belief updating can be efficiently approximated using only partial information of the belief functions involved. Experiments show that the method produces results with high degree of accuracy whilst achieving a significant decrease in computational and space complexity (compared to exact methods).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evidential Reasoning with Conditional Belief Functions

In the existing evidential networks with belief functions, the relations among the variables are always represented by joint belief functions on the product space of the involved variables. In this paper, we use conditional belief functions to represent such relations in the network and show some relations of these two kinds of representations. We also present a propagation algorithm for such n...

متن کامل

A Reasoning Method in Conditional Evidential Networks based on Dezert-Smarandache Model

Aiming to solving the problem that the evidence information based on Dezert-Smarandache (DSm) model can not be fused effectively in Conditional Evidential Network based on Smets/DS model (ENC), a reasoning method in Conditional Evidential Network based on DSm model is proposed. First, the conditional reasoning formular in Conditional Evidential Network based on DSm model is proved and the reaso...

متن کامل

A New Conditioning Rule, Its Generalization and Evidential Reasoning

Abstract In Evidence theory, several conditioning rules for updating belief have been proposed, including Dempster’s rule of conditioning. The paper views the conditioning rules proposed so far and proposes a new rule of conditioning based on three requirements. Then, it generalizes the rule to be applied to the case where condition is given by an uncertain belief. The paper also discusses a fe...

متن کامل

On the Complexity of the Graphical Representation and the Belief Inference in the Dynamic Directed Evidential Networks with Conditional Belief Functions

Directed evidential graphical models are important tools for handling uncertain information in the framework of evidence theory. They obtain their efficiency by compactly representing (in)dependencies between variables in the network and efficiently reasoning under uncertainty. This paper presents a new dynamic evidential network for representing uncertainty and managing temporal changes in dat...

متن کامل

Belief Function Propagation in Directed Evidential Networks

In this paper, we propose a computational data structure based on the binary join tree where the independence relations of the original directed evidential networks (DEVN) are maintained. The proposed solution uses disjunctive rule of combination (DRC) and generalized Bayesian theorem (GBT), which make possible the use of the conditional belief functions directly for reasoning in the DEVN.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017